ar X iv : 1 41 0 . 87 50 v 1 [ cs . L G ] 3 1 O ct 2 01 4 Learning Mixtures of Ranking Models ∗

ar X iv : 1 71 0 . 05 14 0 v 1 [ cs . C C ] 1 4 O ct 2 01 7 On complexity of multidistance graph recognition in R 1 Mikhail Tikhomirov

Let A be a set of positive numbers. A graph G is called an Aembeddable graph in R if the vertices of G can be positioned in R so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.

ar X iv : n uc l - th / 0 61 01 28 v 1 3 1 O ct 2 00 6 Factorization for hadronic heavy quarkonium production ⋆ Jian

We briefly review several models of heavy quarkonium production in hadronic collisions, and discuss the status of QCD factorization for these production models.

ar X iv : g r - qc / 0 51 01 27 v 1 3 1 O ct 2 00 5 Imprints of Spacetime Topology in the Hawking - Unruh Effect

ar X iv : 1 41 2 . 60 75 v 1 [ cs . D M ] 2 2 O ct 2 01 4 A Generalized Cheeger Inequality ∗

where capG(S, S̄) is the total weight of the edges crossing from S to S̄ = V − S. We show that the minimum generalized eigenvalue λ(LG, LH) of the pair of Laplacians LG and LH satisfies λ(LG, LH) ≥ φ(G,H)φ(G)/8, where φ(G) is the usual conductance of G. A generalized cut that meets this bound can be obtained from the generalized eigenvector corresponding to λ(LG, LH). The inequality complements a...

Doubly Balanced Connected Graph Partitioning

We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let G=(V,E) be a connected graph with a weight (supply/demand) function p:V→ {−1,+1} satisfying p(V )= ∑ j∈V p(j)=0. The objective is to partition G into (V1, V2) such that G[V1] and G[V2] are connected, |p(V1)|, |p(V2)|≤cp, and max{ |V1| |V2| , |V2| |V1|}≤cs, for some constants cp and cs. When G is 2-connec...